Solving fuzzy $(1+ n)$-dimensional Burgers’ equation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decay Mode Solutions to (2 + 1)-Dimensional Burgers Equation, Cylindrical Burgers Equation and Spherical Burgers Equation

Three (2 + 1)-dimensional equations—Burgers equation, cylindrical Burgers equation and spherical Burgers equation, have been reduced to the classical Burgers equation by different transformation of variables respectively. The decay mode solutions of the Burgers equation have been obtained by using the extended G G ′       -expansion method, substituting the solutions obtained into the cor...

متن کامل

Solving Burgers’ equation using C-N scheme and RBF collocation

Burgers’ equations is one of the typical nonlinear evolutionary partial differential equations. In this paper, a mesh-free method is proposed to solve the Burgers’ equation numerically using the finite difference and collocation methods. After the temporal discretization of the equation using C-N Scheme, the solution is approximated spatially by Radial Basis Function (RBF). The numerical result...

متن کامل

Reproducing Kernel Space Hilbert Method for Solving Generalized Burgers Equation

In this paper, we present a new method for solving Reproducing Kernel Space (RKS) theory, and iterative algorithm for solving Generalized Burgers Equation (GBE) is presented. The analytical solution is shown in a series in a RKS, and the approximate solution u(x,t) is constructed by truncating the series. The convergence of u(x,t) to the analytical solution is also proved.

متن کامل

Solving Burgers' Equation Using Optimal Rational Approximations

Abstra t. We solve vis ous Burger's equation using a fast and a urate algorithm referred to here as the redu tion algorithm for omputing near optimal rational approximations. Given a proper rational fun tion with n poles, the redu tion algorithm omputes (for a desired L ∞ -approximation error) a rational approximation of the same form, but with a (near) optimally small number m ≪ n of poles. Al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Difference Equations

سال: 2021

ISSN: 1687-1847

DOI: 10.1186/s13662-021-03376-y